STRING: finding tandem repeats in DNA sequences
نویسندگان
چکیده
منابع مشابه
STRING: finding tandem repeats in DNA sequences
MOTIVATION AND RESULTS The importance of Tandem Repeats in some genomes is now well established. We have reported elsewhere some interesting new results obtained by means of a preliminary program for finding Tandem Repeats in DNA sequences, together with a brief description of the basic ideas of the algorithm. We describe here a completely new program based only in part on those ideas, we brief...
متن کاملFiltering Tandem Repeats in DNA Sequences
A tandem repeat is a sequence of two or more contiguous, approximate copies of a pattern. Tandem repeats occur in the genomes of both eukaryotic and prokaryotic organisms. They are important in numerous fields including disease diagnosis, mapping studies, human identity testing (DNA fingerprinting), sequence homology, and population studies. Although tandem repeats have been used by biologists ...
متن کاملFinding All Tandem Arrays in DNA Sequences
A tandem array is a substring of the form k x , where x is any unspecific substring and k is at least two (when k is 2, 2 x is also called a tandem repeat or square). A non-extendable tandem array occurring in string S is a tandem array k x which are not followed or preceded by another occurrence of x in S. The problem of this thesis is defined as follows: Given a string S of length n, find all...
متن کاملTandem repeats finder: a program to analyze DNA sequences.
A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size, copy number, mutational history, etc. for tandem repeats has been limited by the inability to easil...
متن کاملLinear time algorithms for finding and representing all the tandem repeats in a string
A tandem repeat (or square) is a string aa; where a is a non-empty string. We present an OðjSjÞ-time algorithm that operates on the suffix tree TðSÞ for a string S; finding and marking the endpoint in TðSÞ of every tandem repeat that occurs in S: This decorated suffix tree implicitly represents all occurrences of tandem repeats in S; and can be used to efficiently solve many questions concernin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2003
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btg268